Sequent Calculi for the Normal Terms of the λΠ- and λΠ∑-Calculi
نویسندگان
چکیده
منابع مشابه
Sequent Calculi for the Normal Terms of the - and - Calculi
This paper presents two sequent calculi, requiring no clausal form for types, whose typable terms are in 1-1 correspondence with the normal terms of the-and-calculi. Such sequent calculi allow no permutations in the order in which inference rules occur on derivations of typable terms and are thus appropriate for proof search. In these calculi proof search can be performed in a root-rst fashion ...
متن کاملModularisation of Sequent Calculi for Normal and Non-normal Modalities
In this work we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to ordinary sequent rules we obtain linear nested sequent calculi for a number of logics, including to our knowledge the first nested sequent calculi for a large class of simply dependent multimodal logics, and for many ...
متن کاملNested Sequent Calculi and Theorem Proving for Normal Conditional Logics
In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...
متن کاملInvertibility in Sequent Calculi
The invertibility of the rules of a sequent calculus is important for guiding proof search and can be used in some formalised proofs of Cut admissibility. We present sufficient conditions for when a rule is invertible with respect to a calculus. We illustrate the conditions with examples. It must be noted we give purely syntactic criteria; no guarantees are given as to the suitability of the ru...
متن کاملCounterfactual logics: natural deduction calculi and sequent calculi
Counterfactual logics, which have a long and venerable history [3, 1, 2], have been introduced to capture counterfactual sentences, i.e. conditionals of the form “if A were the case, then B would be the case”, where A is false. If we interpret counterfactuals as material conditionals, we have that all counterfactuals are trivially true and this is an unpleasant conclusion. By means of counterfa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)01182-5